منابع مشابه
Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملConnectivity of graphs with given girth pair
Girth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. Graph Theory 7 (1983) 209–218]. The odd girth (even girth) of a graph is the length of a shortest odd (even) cycle. Let g denote the smaller of the odd and even girths, and let h denote the larger. Then (g, h) is called the girth pair of the graph. In this paper we prove that a graph with girth pair (g, h...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملRandomly Colouring Graphs with Girth Five and Large Maximum Degree
We prove that the Glauber dynamics on the k-colourings of a graph G on n vertices with girth 5 and maximum degree ∆ ≥ 1000 log n mixes rapidly if k = q∆ and q > β where β = 1.645... is the root of 2− (1− e−1/β)2 − 2βe−1/β = 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2000
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0398